Flat transversals to flats and convex sets of a fixed dimension
نویسندگان
چکیده
منابع مشابه
Topological transversals to a family of convex sets
Let F be a family of compact convex sets in R. We say that F has a topological ρ-transversal of index (m, k) (ρ < m, 0 < k ≤ d − m) if there are, homologically, as many transversal m-planes to F as m-planes containing a fixed ρ-plane in R. Clearly, if F has a ρ-transversal plane, then F has a topological ρ-transversal of index (m, k), for ρ < m and k ≤ d − m. The converse is not true in general...
متن کاملK-transversals of Parallel Convex Sets
R d can be divided into a union of parallel d k ats of the form x g x g xk gk where the gi are constant Let C be a family of parallel d k dimensional convex sets meaning that each is contained in one of the above parallel d k ats We give a parameterization of the set of k ats in R such that the set of k ats which intersect in a point any set c C is convex Parameterizing the lines in R through h...
متن کاملthe aesthetic dimension of howard barkers art: a frankfurtian approach to scenes from an execution and no end of blame
رابطه ی میانِ هنر و شرایطِ اجتماعیِ زایش آن همواره در طولِ تاریخ دغدغه ی ذهنی و دل مشغولیِ اساسیِ منتقدان و نیز هنرمندان بوده است. از آنجا که هنر در قفس آهنیِ زندگیِ اجتماعی محبوس است، گسترش وابستگیِ آن با نهاد ها و اصولِ اجتماعی پیرامون، صرفِ نظر از هم سو بودن و یا غیرِ هم سو بودنِ آن نهاد ها، امری اجتناب ناپذیر به نظر می رسد. با این وجود پدیدار گشتنِ چنین مباحثِ حائز اهمییتی در میان منتقدین، با ظهورِ مکتب ما...
Convex Transversals
We answer the question initially posed by Arik Tamir at the Fourth NYU Computational Geometry Day (March, 1987): “Given a collection of compact sets, can one decide in polynomial time whether there exists a convex body whose boundary intersects every set in the collection?” We prove that when the sets are segments in the plane, deciding existence of the convex stabber is NP-hard. The problem re...
متن کاملNotes on Convex Transversals
In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line segments.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2007
ISSN: 0001-8708
DOI: 10.1016/j.aim.2007.01.017